GraphState - a tool for graph identification and labelling

The Maximum Number of Edges in a Strongly Multiplicative Graph

On the bandwidth of Mobius graphs

Bandwidth labelling is a well known research area in graph theory. We provide a new proof that the bandwidth of Mobius ladder is 4, if it is not a $K_{4}$, and investigate the bandwidth of a wider class of Mobius graphs of even strips.

BLer: A Boundary Labeller for Technical Drawings

In technical drawings and medical drawings/maps it is often common to explain certain features of the drawing by blocks of text that are arranged on its boundary. Bekos et. al. introduced the term boundary labelling to describe this special type of labelling and presented algorithms for automatic boundary labelling. BLer is a prototype tool aiming to automate the boundary labelling process. It ...

On the Maximum Density of Graphs with Unique-Path Labelings

A unique-path labelling of a simple, finite graph is a labelling of its edges with real numbers such that, for every ordered pair of vertices (u, v), there is at most one nondecreasing path from u to v. In this paper we prove that any graph on n vertices that admits a unique-path labelling has at most n log2(n)/2 edges, and that this bound is tight for infinitely many values of n. Thus we signi...

ساخت یک نرم‏افزار رایانه‏ای جهت طراحی پروتزهای پارسیل متحرک

Background and Aim: Designing removable partial dentures is one of the most important phases of prosthetic treatments. Computer can be used to facilitate and increase accuracy of removable partial denture design. The aim of this study was to develop a software for removable partial denture design.Materials and Methods: A questionnaire (discussed in part I) and major textbooks, were used to dete...